A polynomial-time algorithm for near-unanimity graphs
نویسندگان
چکیده
We present a simple polynomial-time algorithm that recognises reflexive, symmetric graphs admitting a near-unanimity operation. Several other characterisations of these graphs are also presented. 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Near-Unanimity Functions and Varieties of Reflexive Graphs
Let H be a graph and k ≥ 3. A near-unanimity function of arity k is a mapping g from the k-tuples over V (H) to V (H) such that g(x1, x2, . . . , xk) is adjacent to g(x ′ 1, x ′ 2, . . . , x ′ k) whenever xix ′ i ∈ E(H) for each i = 1, 2, . . . , k, and g(x1, x2, . . . , xk) = a whenever at least k − 1 of the xi’s equal a. Feder and Vardi proved that, if a graph H admits a near-unanimity functi...
متن کاملReflexive digraphs with near unanimity polymorphisms
In this paper we prove that if a finite reflexive digraph admits Gumm operations, then it also admits a near unanimity operation. This is a generalization of similar results obtained earlier for posets and symmetric reflexive digraphs by the second author and his collaborators. In the special case of reflexive digraphs our new result confirms a conjecture of Valeriote that states that any finit...
متن کاملA modifiction of the CSP algorithm for infinite languages
Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved [4, 18] that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NPcomplete. In the paper we present a modification of the a...
متن کاملRobust algorithms with polynomial loss for near-unanimity CSPs
An instance of the Constraint Satisfaction Problem (CSP) is given by a family of constraints on overlapping sets of variables, and the goal is to assign values from a fixed domain to the variables so that all constraints are satisfied. In the optimization version, the goal is to maximize the number of satisfied constraints. An approximation algorithm for CSP is called robust if it outputs an as...
متن کاملThe Proof of CSP Dichotomy Conjecture
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 55 شماره
صفحات -
تاریخ انتشار 2005